Deadline Allocation in a Time-Constrained Workflow
نویسندگان
چکیده
Workflow management systems should efficiently manage workflow constraints such as time, resource, and cost during workflow executions. Especially, workflow time management is important in timely scheduling of workflow process execution, avoiding deadline violations, and improving the workflow throughput. Though there have been some studies on the dynamic deadline management in a workflow, the importance of the static deadline management has not been much addressed in the past. We first describe our workflow model considered in this paper. Then, we propose a static deadline allocation method that can facilitate an efficient workflow processing. The proposed method can achieve high workflow throughput by analyzing the interrelated workflow components. We also present various experimental results that show the usefulness and efficiency of the method.
منابع مشابه
A Clustering Approach to Scientific Workflow Scheduling on the Cloud with Deadline and Cost Constraints
One of the main features of High Throughput Computing systems is the availability of high power processing resources. Cloud Computing systems can offer these features through concepts like Pay-Per-Use and Quality of Service (QoS) over the Internet. Many applications in Cloud computing are represented by workflows. Quality of Service is one of the most important challenges in the context of sche...
متن کاملScore Based Deadline Constrained Workflow Scheduling Algorithm for Cloud Systems
Cloud Computing is the latest and emerging trend in information technology domain. It offers utilitybased IT services to user over the Internet. Workflow scheduling is one of the major problems in cloud systems. A good scheduling algorithm must minimize the execution time and cost of workflow application along with QoS requirements of the user. In this paper we consider deadline as the major co...
متن کاملA Comparative Study of Scheduling Algorithms for the Multiple Deadline-constrained Workflows in Heterogeneous Computing Systems with Time Windows
Scheduling tasks with precedence constraints on a set of resources with different performances is a well-known NP-complete problem, and a number of effective heuristics has been proposed to solve it. If the start time and the deadline for each specific workflow are known (for example, if a workflow starts execution according to periodic data coming from the sensors, and its execution should be ...
متن کاملCo-scheduling Deadline-Sensitive Applications in Large-scale Grid Systems
In large-scale grid systems, plenty of applications are constrained by soft or hard deadline requirement. However, it is difficult to guarantee the deadline requirements of these applications because of the dynamical nature of distributed systems. In this paper, a novel approach is proposed to evaluate the deadline-guarantee of co-allocation schemes that obtained from conventional co-allocation...
متن کاملA Multi-Mode Resource-Constrained Optimization of Time-Cost Trade-off Problems in Project Scheduling Using a Genetic Algorithm
In this paper, we present a genetic algorithm (GA) for optimization of a multi-mode resource constrained time cost trade off (MRCTCT) problem. The proposed GA, each activity has several operational modes and each mode identifies a possible executive time and cost of the activity. Beyond earlier studies on time-cost trade-off problem, in MRCTCT problem, resource requirements of each execution mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Cooperative Inf. Syst.
دوره 10 شماره
صفحات -
تاریخ انتشار 2001